Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
201	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
202	Constant-Time Testing and Learning of Image Properties (full version) arXiv:1503.01363v2 [cs.DS] 6 MarPiotr Berman∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-08 21:15:52 Analysis of algorithms Computational complexity theory Approximation algorithms Property testing Time complexity Algorithm Randomized algorithm Theoretical computer science Applied mathematics Mathematics
203	C:/Users/mount/Documents/Rsrch/Sunil/Polytope/Polytope-STOC11-cam-ready/stoc354t-arya.dvi Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2011-11-01 08:26:45 Discrete geometry Computational geometry Approximation algorithms Search algorithms Information retrieval Nearest neighbor search Ε-net K-d tree Voronoi diagram Information science Mathematics Geometry
204	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
205	1 Space-Time Tradeoffs for Approximate Nearest Neighbor Searching SUNIL ARYA Hong Kong University of Science and Technology, Kowloon, Hong Kong, China Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2013-03-12 23:54:45 Discrete geometry Search algorithms Approximation algorithms Computational geometry Information retrieval Nearest neighbor search Quadtree Point location Voronoi diagram Information science Mathematics Geometry
206	A Unified Approach to Approximate Proximity Searching Sunil Arya∗ Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2010-08-18 06:11:37 Search algorithms Approximation algorithms Data mining Image processing Information retrieval Nearest neighbor search K-d tree Point location Range searching Information science Mathematics Computing
207	Syntactic Characterizations of Polynomial Time Optimization Classes Prabhu Manyem School of Information Technology and Mathematical Sciences University of Ballarat Mount Helen, VIC 3350, Australia. Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2008-07-15 06:05:48 Complexity classes Computational problems Operations research Optimization problem NP Approximation algorithms Mathematical optimization Time complexity Decision problem Theoretical computer science Computational complexity theory Applied mathematics
208	50 A New Upper Boundon 2D Online Bin Packing XIN HAN, Dalian University of Technology FRANCIS Y. L. CHIN and HING-FUNG TING, The University of Hong Kong GUOCHUAN ZHANG, Zhejiang University Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2012-07-19 02:15:26 Bin packing problem Analysis of algorithms Algorithm Approximation algorithm Packing problem Randomized algorithm Theoretical computer science Mathematics Applied mathematics
209	Nearest Neighbor Search in high-dimensional spaces Alexandr Andoni (Princeton/CCI → MSR SVC) Barriers II August 30, 2010 Add to Reading List Source URL: www.mit.edu Language: English - Date: 2010-09-04 11:51:32 Geometry Search algorithms Approximation algorithms Mathematical optimization Nearest neighbor search Numerical analysis Voronoi diagram Locality-sensitive hashing Information science Mathematics Discrete geometry
210	1 Sparse Recovery Using Sparse Matrices Anna Gilbert, Piotr Indyk Abstract—We survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-05-15 17:43:14 Numerical linear algebra Matrix theory Sparse matrix Matrix Sparse approximation Belief propagation Eigenvalues and eigenvectors Time complexity Algebra Mathematics Linear algebra

UPDATE